An new hybrid cryptosystem based on the satisfiability problem
نویسندگان
چکیده
In this paper we propose a simple hybrid cryptosystem whose security is based upon the satisfiability problem well known NP-complete. The execution of this cryptosystem is illustrated at the end of the paper by a detailed example to understand better how it processes. RÉSUMÉ. Dans ce papier nous proposons un cryptosystème hybride simple, dont la sécurité repose sur le problème de satisfiabilité, connu NP-complet. Son fonctionnement est illustré à la fin du papier par un exemple détaillé.
منابع مشابه
Hybrid Cryptosystem Based on 2-SAT & 3-SAT and the Implications of Polynomial Solvability of 3-SAT
In this paper, we elaborate the security threats that exist on hybrid cryptosystem based on satisfiability problem. In such system the encryption is carried out by generating 3-SAT clauses by random insertion of literal in a given 2-SAT clause instance. The solution of 2-SAT clause instance gives the secret key and the placement of literal for conversion to 3-SAT gives the position vector. Two ...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملAn ontological hybrid recommender system for dealing with cold start problem
Recommender Systems ( ) are expected to suggest the accurate goods to the consumers. Cold start is the most important challenge for RSs. Recent hybrid s combine and . We introduce an ontological hybrid RS where the ontology has been employed in its part while improving the ontology structure by its part. In this paper, a new hybrid approach is proposed based on the combination of demog...
متن کاملA New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Stud. Inform. Univ.
دوره 9 شماره
صفحات -
تاریخ انتشار 2011